翻訳と辞書 Words near each other ・ An Chang-nam ・ An Chang-ryon ・ An Chi-hong ・ An Cho-young ・ An Chol-hyok ・ An Chonghui ・ An Chongrong ・ An Chuallacht, UCC ・ An Chun-young ・ An Châu ・ An Châu (township) ・ An Claidheamh Soluis ・ An Clasach Ó Cobhthaigh ・ An Claíomh Solais ・ An Cléireach ・ AN codes ・ An Coimisinéir Teanga ・ An Collins ・ An Comunn Gàidhealach ・ An Congjin ・ An Cosantóir ・ An Cosnmhaidh Ua Dubhda ・ An County ・ An cumann craic ・ An Cumann Gaelach, QUB ・ An Cumann Gaelach, TCD ・ An Cư ・ An Dae-hyun ・ An Daoquan ・ An Dara Craiceann Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク AN codes ： ウィキペディア英語版 AN codes AN codes〔Peterson, W. W. and Weldon, E. J.: Error-correcting Codes. Cambridge, Mass.: MIT Press, 1972〕 are error-correcting code that are used in arithmetic applications. Arithmetic codes were commonly used in computer processors to ensure the accuracy of its arithmetic operations when electronics were more unreliable. Arithmetic codes help the processor to detect when an error is made and correct it. Without these codes, processors would be unreliable since any errors would go undetected. AN codes are arithmetic codes that are named for the integers $A$ and $N$ that are used to encode and decode the codewords. These codes differ from most other codes in that they use arithmetic weight to maximize the arithmetic distance between codewords as opposed to the hamming weight and hamming distance. The arithmetic distance between two words is a measure of the number of errors made while computing an arithmetic operation. Using the arithmetic distance is necessary since one error in an arithmetic operation can cause a large hamming distance between the received answer and the correct answer. ==Arithmetic Weight and Distance== The arithmetic weight of an integer $x$ in base $r$ is defined by :$w(x)\; =\; \backslash min\; \backslash \backslash \}$ where $||$< $r$, $n(i)\; \backslash geq\; 0$, and $r,\; n(i)\; \backslash in\; \backslash mathbb$. The arithmetic distance of a word is upper bounded by its hamming weight since any integer can be represented by its standard polynomial form of $x=\backslash sum\_^n\; b\_i\; r^i$ where the $b\_i$ are the digits in the integer. Removing all the terms where $b\_i\; =\; 0$ will simulate a $t$ equal to its hamming weight. The arithmetic weight will usually be less than the hamming weight since the $a\_i$ are allowed to be negative. For example, the integer $x\; =\; 29$ which is $11101$ in binary has a hamming weight of $4$. This is a quick upper bound on the arithmetic weight since $x\; =\; 2^0\; +\; 2^2\; +\; 2^3\; +\; 2^4$. However, since the $a\_i$ can be negative, we can write $x\; =\; 2^5\; -\; 2^1\; -\; 2^0$ which makes the arithmetic weight equal to $3$. The arithmetic distance between two integers is defined by :$d(x,y)\; =\; w(x-y)$ This is one of the primary metrics used when analyzing arithmetic codes. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「AN codes」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.